A Note on a Combinatorial Interpretation of thee - Coe cients of the Chromatic Symmetric
نویسنده
چکیده
Stanley has studied a symmetric function generalization X G of the chromatic polynomial of a graph G. The innocent-looking Stanley-Stembridge Poset Chain Conjecture states that the expansion of X G in terms of elementary symmetric functions has nonnegative coeecients if G is a clawfree incomparabil-ity graph. Here we present a new approach that combines Gasharov's work on the conjecture with E~ gecio~ glu and Remmel's combinatorial interpretation of the inverse Kostka matrix. An interesting byproduct of our arguments is a connection, apparently new, between acyclic orientations and P-tableaux.
منابع مشابه
On the Nonnegativity of the Coefficients of Some Polynomials Occurring in the Theory of Cubical Spheres
As part of his recent research into Cubical Spheres, G. Hetyei gave an inductive proof that a certain sequence of polynomials have nonnegative coe cients. In a poster session at the FPSAC'96 conference he asked for a combinatorial interpretation of these coe cients. In this short note we show that known results in rook theory imply that the coe cients count permutations subject to certain const...
متن کاملJust chromatic exellence in fuzzy graphs
A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...
متن کاملA Note on a Combinatorial Interpretation of the e-Coefficients of the Chromatic Symmetric Function
Stanley has studied a symmetric function generalization XG of the chromatic polynomial of a graph G. The innocent-looking Stanley-Stembridge Poset Chain Conjecture states that the expansion of XG in terms of elementary symmetric functions has nonnegative coefficients if G is a clawfree incomparability graph. Here we give a combinatorial interpretation of these coefficients by combining Gasharov...
متن کاملDivisibility of certain coefficients of the chromatic polynomials
This note presents some results on the divisibility of certain coe"cients of the chromatic polynomials. c © 2003 Elsevier B.V. All rights reserved.
متن کاملLifting valid inequalities for the precedence constrained knapsack problem
This paper considers the precedence constrained knapsack problem. More speci cally, we are interested in classes of valid inequalities which are facet-de ning for the precedence constrained knapsack polytope. We study the complexity of obtaining these facets using the standard sequential lifting procedure. Applying this procedure requires solving a combinatorial problem. For valid inequalities ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997